The p-maxian problem on interval graphs
نویسندگان
چکیده
منابع مشابه
Interval p-Neighborhood Graphs
The (p)-neighborhood graph of a graph G, denoted N p (G), is de-ned on the same vertex set as G, with x; y] 2 E (N 2 (G)) if and only if jN(x)\N(y)j p in G, where N (v) is the open neighborhood of vertex v. The p]-neighborhood graph of G, N p G], is deened similarly, using closed neighborhoods rather than open ones. If G is the underlying graph of a symmetric digraph D, then the p-neighborhood ...
متن کاملEdge Monitoring Problem on Interval Graphs
Edge monitoring is a simple and effective mechanism for the security of wireless sensor networks. The idea is to award specific roles (monitors) to some sensor nodes of the network. A node v monitors an edge e if both extremities together with v form a triangle in the graph. Given an edge colored graph G = (V,E, c), the color c(e) is a positive integer representing the number of monitors needed...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملThe inverse $p$-maxian problem on trees with variable edge lengths
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...
متن کاملThe Invere p-Maxian Problem on Trees with Variable Edge Lengths
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.08.021